A Mathematical Model for Course Timetabling Problem With Faculty-Course Assignment Constraints
نویسندگان
چکیده
University course timetabling problem (UCTP) includes the challenging task of generating an automated timetable for courses under resource limitations. Manual generated timetables might hold some errors and consume a long time to create feasible solutions. Thus, there is need find optimal fast solutions this problem. The difficulty further increased when tackling faculty-related constraints, according their requirements, preferences, availability. student-related constraints are usually focus UCTP solutions, in which faculty limited teaching load or preferences. This paper proposes multi-objective mixed-integer programming model preregistration UCTP, combined with constraints. goal maximize events assignments faculty-members preferences satisfaction while balancing university requirements. At same time, student learning days unassigned minimized. tested eight real-world instances. Computational experiments carried out show efficiency model. proposed method can generate all instances that satisfy
منابع مشابه
A multiobjective faculty-course-time slot assignment problem with preferences
A faculty-course-time slot assignment problem is studied. The multiobjective 0-1 linear programming model considering both the administration’s and instructors’ preferences is developed and a demonstrative example is included. Both modeling and solving such problems are difficult tasks due to the size, the varied nature, and conflicting objectives of the problems. The difficulty increases becau...
متن کاملHeuristic Faculty Course Timetabling with Student Sectioning
This paper studies a real faculty course timetabling problem of Faculty of Computer Science and Information Technology (FCSIT), Universiti Malaysia Sarawak (UNIMAS). FCSIT offers 5 four-year programmes. Each programme has own set of courses but some courses are required by more than one programme. List of courses for each semester of all programmes are planned and suggested by faculty as in cou...
متن کاملNew Constraints and Features for the University Course Timetabling Problem
The university course timetabling problem deals with the task of scheduling lectures of a set of university courses into a given number of rooms and time periods, taking into account various hard and soft constraints. The goal of the International Timetabling Competitions ITC2002 and ITC2007 was to establish models for comparison that cover the most frequently found use cases. Our model, motiva...
متن کاملUniversity Course Timetabling with Soft Constraints
An extension of constraint logic programming that allows for weighted partial satisfaction of soft constraints is described and applied to the development of an automated timetabling system for Purdue University. The soft constraint solver implemented in the proposed solution approach allows constraint propagation for hard constraints together with preference propagation for soft constraints. A...
متن کاملSAT Model for the Curriculum-Based Course Timetabling Problem
Two widely used problems are the Satisfiability problem (SAT) and the Curriculum-Based Course Timetabling (CB-CTT) problem. The SAT problem searches for an assignment that make true a certain boolean formula. On the other side, the CB-CTT involves the task of scheduling lectures of courses to rooms, considering teacher availability, a specified curricula, and a set of constraints. Given the adv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3103495